Fuzzy Answer Set Programming with Literal Preferences
نویسندگان
چکیده
In the current approaches to fuzzy answer set programming (FASP) one can state preferences amongst rules to denote their relative importance. However, in many situations we need more complex preferences such as those in the answer set optimization framework proposed by Brewka for crisp answer set programming. Unfortunately, these complex preferences do not readily fit into the current FASP approaches. In this paper we propose a language to state such preferences and show that programs with these preferences can be translated into equivalent general fuzzy answer set programming (gFASP) programs. This not only provides an implementation method, but also shows that this extension can be added as syntactic sugar on top of general fuzzy answer set programming solvers. Keywords— Logic Programming, Fuzzy Logic, Answer Set Programming, Preference-based Logic Programming.
منابع مشابه
Logical Fuzzy Preferences
We present a unified logical framework for representing and reasoning about both quantitative and qualitative preferences in fuzzy answer set programming [Saad, 2010; Saad, 2009; Subrahmanian, 1994], called fuzzy answer set optimization programs. The proposed framework is vital to allow defining quantitative preferences over the possible outcomes of qualitative preferences. We show the applicat...
متن کاملLearning by Answer Sets
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we introduce techniques for inducing new rules using answer sets of the program. The produced new rules explain positive/negative examples in the context of inductive logic programming. The result of this paper combines tec...
متن کاملTemporally Annotated Extended Logic Programs
Extended logic programs (ELPs) are a set of logic rules with strong negation allowed in the bodies or head of the rules and weak negation ~ allowed in the bodies of the rules. ELPs enable for various forms of reasoning that cannot be achieved by definite logic programs. Answer Set Programming provides a widely acceptable semantics for ELPs. However, ELPs do not provide information regarding t...
متن کاملQualitative Decision Making and Answer Set Programming Extended Abstract
In a recent paper [BBL02] a propositional logic called Qualitative Choice Logic ( ) was introduced. The logic contains a new connective representing ordered disjunction. Intuitively, stands for: if possible , but if is impossible then (at least) . This connective allows context dependent preferences to be represented in a simple and elegant fashion. In this paper we show how to combine ideas un...
متن کاملJustifying answer sets using argumentation
An answer set is a plain set of literals which has no further structure that would explain why certain literals are part of it and why others are not. We show how argumentation theory can help to explain why a literal is or is not contained in a given answer set by defining two justification methods, both of which make use of the correspondence between answer sets of a logic program and stable ...
متن کامل